Convex envelopes for fixed rank approximation

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Convex Envelopes for Low Rank Approximation

In this paper we consider the classical problem of finding a low rank approximation of a given matrix. In a least squares sense a closed form solution is available via factorization. However, with additional constraints, or in the presence of missing data, the problem becomes much more difficult. In this paper we show how to efficiently compute the convex envelopes of a class of rank minimizati...

متن کامل

Linear Convergence in the Approximation of Rank-one Convex Envelopes

A linearly convergent iterative algorithm that approximates the rank-1 convex envelope f of a given function f : Rn×m → R, i.e. the largest function below f which is convex along all rank-1 lines, is established. The proposed algorithm is a modified version of an approximation scheme due to Dolzmann and Walkington. Mathematics Subject Classification. 65K10, 74G15, 74G65, 74N99. Received: May 27...

متن کامل

A numerical iterative scheme for computing finite order rank-one convex envelopes

Abstract. It is known that the i-th order laminated microstructures can be resolved by the k-th order rank-one convex envelopes with k ≥ i. So the requirement of establishing an efficient numerical scheme for the computation of the finite order rank-one convex envelopes arises. In this paper, we develop an iterative scheme for such a purpose. The 1-st order rank-one convex envelope R1f is appro...

متن کامل

Fixed Points and Best Approximation in Menger Convex Metric Spaces

Nonexpansive mappings have been studied extensively in recent years by many authors.The first fixed point theorem of a general nature for nonlinear nonexpansive mappings in noncompact setting were proved independently by Browder [8] and Gohde [12]. Later on, Kirk [17] proved the same results under slightly weaker assumptions. A fundamental problem in fixed point theory of nonexpansive mappings ...

متن کامل

An Approximation Method for Fuzzy Fixed-Charge Transportation Problem

In this paper, we develop the fuzzy fixed charge transportation problem when the costs are the fuzzy numbers. The first step it transform into the classical fuzzy transportation problem. The next, we obtain the best approximation fuzzy on the optimal value of the fuzzy fixed-charge transportation problem. This method obtains a lower and upper bounds both on the fuzzy optimal value of the fuzzy ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Optimization Letters

سال: 2017

ISSN: 1862-4472,1862-4480

DOI: 10.1007/s11590-017-1146-5